A new approximation hierarchy for polynomial conic optimization
نویسندگان
چکیده
منابع مشابه
High order parametric polynomial approximation of conic sections
In this paper, a particular shape preserving parametric polynomial approximation of conic sections is studied. The approach is based upon a general strategy to the parametric approximation of implicitly defined planar curves. Polynomial approximants derived are given in a closed form and provide the highest possible approximation order. Although they are primarily studied to be of practical use...
متن کاملA bounded degree SOS hierarchy for polynomial optimization
We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem (P ) : f∗ = min{ f(x) : x ∈ K } on a compact basic semi-algebraic set K ⊂ Rn. This hierarchy combines some advantages of the standard LP-relaxations associated with Krivine’s positivity certificate and some advantages of the standard SOS-hierarchy. In particular it has the following attractiv...
متن کاملConic Approximation with Provable Guarantee for Traffic Signal Offset Optimization
We consider the offset optimization problem that coordinates the offsets of signalized intersections to reduce vehicle queues in large-scale signalized traffic networks. We adopt a recent approach that transforms the offset optimization problem into a complex-valued quadratically-constrained quadratic program (QCQP). Using the special structure of the QCQP, we provide a π/4-approximation algori...
متن کاملApproximation Methods for Inhomogeneous Polynomial Optimization
In this paper, we consider computational methods for optimizing a multivariate inhomogeneous polynomial function over a compact set. The focus is on the design and analysis of polynomial-time approximation algorithms. The references on approximation algorithms for inhomogeneous polynomial optimization problems are extremely scarce in the literature. To the best of our knowledge, the only result...
متن کاملApproximation methods for complex polynomial optimization
Complex polynomial optimization problems arise from real-life applications including radar code design, MIMO beamforming, and quantum mechanics. In this paper, we study complex polynomial optimization models whereby the objective function takes one of the following three forms: (1) multilinear; (2) homogeneous polynomial; (3) a conjugate symmetric form. On the constraint side, the decision vari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2019
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-019-00066-0